Robust parametric inference for finite Markov chains

نویسندگان

چکیده

We consider the problem of statistical inference in a parametric finite Markov chain model and develop robust estimator parameters defining transition probabilities via minimization suitable (empirical) version popular density power divergence. Based on long sequence observations from first-order stationary chain, we have defined minimum divergence (MDPDE) underlying parameter rigorously derived its asymptotic robustness properties under appropriate conditions. Performance MDPDEs is illustrated theoretically as well empirically for some common examples models. Its applications testing hypotheses are also discussed along with (parametric) comparison two sequences. Several directions extending MDPDE related briefly multiple sequences chains, higher order chains non-stationary time-dependent probabilities. Finally, our proposal applied to analyze corporate credit rating migration data three international markets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian inference for Markov chains ∗

We consider the estimation of Markov transition matrices by Bayes’ methods. We obtain large and moderate deviation principles for the sequence of Bayesian posterior distributions. MSC 2000 subject classification: 60F10, 62M05

متن کامل

Parametric LTL on Markov Chains

This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the untilmodality is equipped with a bound that contains variables; e.g., ♦6x φ asserts that φ holds within x time steps, where x is a variable on natural numbers. The central problem studied in this paper is to determine the set of parameter valuations V≺p(φ) for which the p...

متن کامل

Consistency for Parametric Interval Markov Chains

Interval Markov Chains (IMCs) are the base of a classic probabilistic specification theory by Larsen and Jonsson in 1991. They are also a popular abstraction for probabilistic systems. In this paper we introduce and study an extension of Interval Markov Chains with parametric intervals. In particular, we investigate the consistency problem for such models and propose an efficient solution for t...

متن کامل

Parameter Synthesis for Parametric Interval Markov Chains

Interval Markov Chains (IMCs) are the base of a classic probabilistic specification theory introduced by Larsen and Jonsson in 1991. They are also a popular abstraction for probabilistic systems. In this paper we study parameter synthesis for a parametric extension of Interval Markov Chains in which the endpoints of intervals may be replaced with parameters. In particular, we propose constructi...

متن کامل

Finite Markov Chains

This paper provides basic information and theorems about finite Markov chains. The inspiration for this paper came from Professor Laci Babai’s Discrete Mathematics lecture notes from the REU program of 2003. After reading through his chapter on Markov chains, I decided to proceed by answering as many exercises from the notes as possible. Below is what I have finished.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Test

سال: 2021

ISSN: ['0193-4120']

DOI: https://doi.org/10.1007/s11749-021-00771-1